Representation of the core of convex measure games via Kantorovich potentials
نویسنده
چکیده
We establish a representation of the core of convex measure games by means of rearrangement ideas and the notion of Kantorovich potentials. Our representation was first proved by Marinacci and Montrucchio [7] when the underlying measurable structure is that of a standard Borel space. The approach presented here is completely different and does not require this assumption.
منابع مشابه
A Hard Convex Core Yukawa Equation of State for Nonassociated Chain Molecules
The compressibility factor of nonassociated chain molecules composed of hard convex core Yukawa segments was derived with SAFT-VR and an extension of the Barker-Henderson perturbation theory for convex bodies. The temperature-dependent chain and dispersion compressibility factors were derived using the Yukawa potential. The effects of temperature, packing fraction, and segment number on the com...
متن کاملStability Via Convexity and LP Duality in OCF Games
The core is a central solution concept in cooperative game theory, and therefore it is important to know under what conditions the core of a game is guaranteed to be non-empty. Two notions that prove to be very useful in this context are Linear Programming (LP) duality and convexity. In this work, we apply these tools to identify games with overlapping coalitions (OCF games) that admit stable o...
متن کاملOn the Extreme Points of the Core of Neighbour Games and Assignment Games
Neighbour games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, neighbour games are as well assignment games as line graph restricted games. We will show that the intersection of the class of assignment games and the class of line graph restricted games yields the class of neighbour games. Further, w...
متن کاملConvex structures via convex $L$-subgroups of an $L$-ordered group
In this paper, we first characterize the convex $L$-subgroup of an $L$-ordered group by means of fourkinds of cut sets of an $L$-subset. Then we consider the homomorphic preimages and the product of convex $L$-subgroups.After that, we introduce an $L$-convex structure constructed by convex $L$-subgroups.Furthermore, the notion of the degree to which an $L$-subset of an $L$-ord...
متن کاملContour Manifolds and Optimal Transport
Describing shapes by suitable measures in object segmentation, as proposed in [24], allows to combine the advantages of the representations as parametrized contours and indicator functions. The pseudo-Riemannian structure of optimal transport can be used to model shapes in ways similar as with contours, while the Kantorovich functional enables the application of convex optimization methods for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003